Computation of the topology of real algebraic space curves
نویسندگان
چکیده
منابع مشابه
Topology of real algebraic space curves
In this paper we give a new projection-based algorithm for computing the topology of a real algebraic space curve given implicitly by a set of equations. Under some genericity conditions, which may be reached through a linear change of coordinates, we show that a plane projection of the given curve, together with a special polynomial in the ideal of the curve contains all the information needed...
متن کاملComputation of the Topology Types of the Level Curves of Real Algebraic Surfaces
In this paper, we address the problem of determining the z-values where the topology type of the level curves of an algebraic surface may change. In the case when the surface is bounded and non-singular, this question is solved by Morse Theory. However, here we consider the problem for the more general case of algebraic surfaces without further restrictions, i.e. not necessarily bounded or smoo...
متن کاملOn the Topology of Real Algebraic Plane Curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of singular and critical points, is also relevant. A challenge is to compute efficiently this information for the given coordinate system even if the curve is not in generic position. Previous methods based on the cylind...
متن کاملTopology and arrangement computation of semi-algebraic planar curves
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are guaranteed to be correct. Although we focus on the implicit case, the algorithm can also treat parametric or piecewise linear curves without much additional work and no theoretical difficulties. The method isolates sing...
متن کاملA Worst-case Bound for Topology Computation of Algebraic Curves
Computing the topology of an algebraic plane curve C means to compute a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with coefficients bounded by 2ρ , the topology of the induced curve can be computed with Õ(n8(n+ρ2)) bit operations deterministically, and with Õ(n8ρ2) bit operations with a randomized algorithm in e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2005
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2005.01.006